Weakly protected nodes in random binary search trees

Here, we derive the exact mean and variance of number weakly protected nodes (the that are not leaves at least one their children is a leaf) in binary search trees grown from random permutations. Furthermore, by using contraction method, prove normal limit law for properly normalized version this tree parameter.